Some Lambda Calculi with Categorial Sums and Products
نویسنده
چکیده
We consider the simply typed-calculus with primitive re-cursion operators and types corresponding to categorical products and coproducts.. The standard equations corresponding to extensionality and to surjectivity of pairing and its dual are oriented as expansion rules. Strong normalization and ground (base-type) connuence is proved for the full calculus; full connuence is proved for the calculus omitting the rule for strong sums. In the latter case, xed-point constructors may be added while retaining connuence.
منابع مشابه
Lambda De nability with Sums via Grothendieck Logical Relations
We introduce a notion of Grothendieck logical relation and use it to characterise the deenability of morphisms in stable bicartesian closed categories by terms of the simply-typed lambda calculus with nite products and nite sums. Our techniques are based on concepts from topos theory, however our exposition is elementary.
متن کاملSome Remarks on Control Categories
This paper is a collection of remarks on control categories, including answers to some frequently asked questions. The paper is not self-contained and must be read in conjunction with [3]. We clarify the definition of response categories, and show that most of the conditions can be dropped. In particular, the requirement of having finite sums can be dropped, leading to an interesting new CPS tr...
متن کاملTree Models and (Labeled) Categorial Grammar
This paper studies the relation between some extensions of the nonassociative Lambek Calculus NL and their interpretation in tree models (free groupoids). We give various examples of sequents that are valid in tree models, but not derivable in NL. We argue why tree models may not be axiomatizable if we add finitely many derivation rules to NL, and proceed to consider labeled calculi instead. We...
متن کاملOn Generalized Ajdukiewicz and Lambek Calculi and Grammars
Investigations concerning the description of languages in terms of categorial grammar started with examining concatenation as the only syntactic operation. Type reduction systems such as associative Ajdukiewicz or Lambek calculi, which admit concatenation of types in the calculus (and consequently concatenation of words in a language) as the expression-forming operation, were proved defective. ...
متن کاملThe Stories of Logic and Information
information theories: relevant and categorial logics Indeed, there are several abstract perspectives merging the two perspectives. One is that of Scott Information Systems, discussed by Michael Dunn in this Handbook. Another line are logics in the tradition of categorial and relevant logic, which have often been given an informational interpretation. One example is the ‘Gaggle Theory’ of Dunn 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993